Duality Between Smooth Min- and Max-Entropies
نویسندگان
چکیده
منابع مشابه
ar X iv : 0 90 7 . 52 38 v 2 [ qu an t - ph ] 2 0 O ct 2 00 9 Duality Between Smooth Min - and Max - Entropies
In classical and quantum information theory, operational quantities such as the amount of randomness that can be extracted from a given source or the amount of space needed to store given data are normally characterized by one of two entropy measures, called smooth min-entropy and smooth max-entropy, respectively. While both entropies are equal to the von Neumann entropy in certain special case...
متن کاملThe Duality Theorem for Min-max Functions
The set of min-max functions F : R → R is the least set containing coordinate substitutions and translations and closed under pointwise max, min, and function composition. The Duality Conjecture asserts that the trajectories of a min-max function, considered as a dynamical system, have a linear growth rate (cycle time) and shows how this can be calculated through a representation of F as an inf...
متن کاملThe Duality Theorem for Min - Max Functionsst
The set of min-max functions F : R n ! R n is the least set containing coordinate substitutions and translations and closed under pointwise max, min, and function composition. The Duality Conjecture asserts that the trajectories of a min-max function, considered as a dynamical system, have a linear growth rate (cycle time) and shows how this can be calculated through a representation of F as an...
متن کاملMax-Min SINR Coordinated Multipoint Downlink Transmission - Duality and Algorithms
This paper considers the max-min weighted signal-to-interference-plus-noise ratio (SINR) problem subject to multiple weighted-sum power constraints, where the weights can represent relative power costs of serving different users. First, we study the power control problem. We apply nonlinear Perron-Frobenius theory to derive closed-form expressions for the optimal value and solution and an itera...
متن کاملDuality of the Max-Plus and Min-Plus Network Calculus
The network calculus is a framework for the analysis of communication net-works, which exploits that many computer network models become tractablefor analysis if they are expressed in a min-plus or max-plus algebra. In amin-plus algebra, the network calculus characterizes amounts of traffic andavailable service as functions of time. In a max-plus algebra, the network cal-cul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2010
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2010.2054130